Querying datalog programs with temporal logic
نویسندگان
چکیده
منابع مشابه
Intelligent Web Querying with Logic Programs
We present a general framework for the information extraction from web pages based on a special wrapper language, called token-templates. By using token-templates in conjunction with logic programs we are able to reason about web page contents, search and collect facts and derive new facts from various web pages. We give a formal deenition for the semantics of logic programs extended by token-t...
متن کاملQuerying TSQL2 Databases with Temporal Logic
We establish an exact correspondence between temporal logic and a subset of TSQL2, a consensus temporal extension of SQL-92. The translation from temporal logic to TSQLZ developed here enables a user to write high-level queries which can be evaluated against a spaceefficient representation of the database. The reverse translation, also provided, makes it possible to characterize the expressive ...
متن کاملTemporal logic programs with variables
In this note we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators. To this aim, we provide a definition of a first-order version of TEL that shares the syntax of first-order Linear-time Temporal Logic (LTL) but has a different ...
متن کاملCodeQuest - Source Code Querying with Datalog
Understanding source code is vital to many tasks in software engineering. Source code querying tools are designed to help such understanding, by allowing programmers to explore relations that exist between different parts of the codebase. The contribution of such a system named CodeQuest is the topic of this dissertation. One of the modern source code querying and browsing tools for Java is JQu...
متن کاملLogic Programs for Querying Inconsistent Databases
Consistent answers from a relational database that violates a given set of integrity constraints (ICs) are characterized at the conceptual level as ordinary answers that can be obtained from every minimally repaired version of the database (a repair). Repairs can be speci ed and interpreted as the stable models of a simple disjunctive normal logic program with database predicates extended with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1993
ISSN: 0001-5903,1432-0525
DOI: 10.1007/bf01191723